Error Properties of Hartley Trans - form Algorithms RLE Technical Report
نویسنده
چکیده
منابع مشابه
Is Trans Fatty Acid Still an Issue for Policy Makers in Iran? A Technical Report
In recent decades, the oil industry has changed its direction toward vegetable oil use instead of animal fats due to various reasons such as a small numbers of animal fat resources and high saturated fatty acids content in animal fats. Therefore, different modification processes have been used to alter the physicochemical properties of vegetable oils, which lack functionality and oxidative stab...
متن کاملImproved Fourier and Hartley transform algorithms: Application to cyclic convolution of real data
This paper highlights the possible tradeoffs between arithmetic and structural complexity when computing cyclic convolution of real data in the transform domain. Both Fourier and Hartley-based schemes are first explained in their usual form and then improved, either from the structural point of view or in the number of operations involved. Namely, we first present an algorithm for the in-place ...
متن کاملRadix-2 × 2 × 2 algorithm for the 3-D discrete Hartley transform
The discrete Hartley transform (DHT) has proved to be a valuable tool in digital signal/image processing and communications and has also attracted research interests in many multidimensional applications. Although many fast algorithms have been developed for the calculation of oneand two-dimensional (1-D and 2-D) DHT, the development of multidimensional algorithms in three and more dimensions i...
متن کاملIndex Transformation Algorithms in a Linear Algebra Framework
We present a linear algebraic formulation for a class of index transformations such as Gray code encoding and decoding, matrix transpose, bit reversal, vector reversal, shuues, and other index or dimension permutations. This formulation uniies, simpliies, and can be used to derive algorithms for hypercube multiprocessors. We show how all the widely known properties of Gray codes and some not so...
متن کاملHartley transforms over finite fields
A general f ramework is presented for constructing transforms in the field of the input which have a convolutionlike property. The construction is carried out over finite fields, but is shown to be valid over the real and complex fields as well. It is shown that these basefield transforms can be v iewed as “projections” of the discrete Fourier transform @IT) and that they exist for all lengths ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1985